00_heaps

01_whats_the_problem

02_introducing_the_priority_queue

03_implementation_options

04_the_solution_the_heap

05_todays_agenda

06_what_is_a_binary_heap

07_shape_property

08_heap_property

09_representing_a_heap

10_array_representation_example

11_core_operations

12_operation_insert

13_bubble_up_process

14_insert_example

15_insert_code_logic

16_insert_time_complexity

17_operation_extractMax

18_bubble_down_process

19_extractMax_example

20_extractMax_code_logic

21_extractMax_time_complexity

22_other_heap_operations

23_build_heap_from_array

24_the_heapify_algorithm

25_heapify_example

26_heapify_complexity_intuition

27_heap_complexity_summary

28_priority_queue

29_heap_sort

30_why_heap_important

31_heap_vs_binary_search_tree

32_a_quick_review

33_beyond_binary_heaps

34_summary_and_next_steps

Your Personal AI Tutor

Ask me anything! Here are some ideas to get started:

Understand Concepts

Ask me to explain the current slide or a concept in simple terms.

"Explain recursion in simple terms." "What is a `Class`?"

Generate Code

Request code examples in different programming languages.

"Binary search example in Python" "How to implement adjacency list in C"

Use Your Tone and Language

Ask in different languages or tones and I'll adapt.

"What does acyclic mean" "呢張slide入面個符號g代表咩" "这里`Heap`的中文是什么"

The AI assistant can make mistakes, verify important info.